The Odds Algorithm Based on Sequential Updating and Its Performance

Let I1, I2, . . . , In be independent indicator functions on someprobability space ( ,A,P). We suppose that these indicators can be observed sequentially. Furthermore, let T be the set of stopping times on (Ik), k = 1, . . . , n, adapted to the increasing filtration (Fk), where Fk = σ(I1, . . . , Ik). The odds algorithm solves the problem of finding a stopping time τ ∈ T which maximises the probability of stopping on the last Ik = 1, if any. To apply the algorithm, we only need the odds for the events {Ik = 1}, that is, rk = pk/(1 − pk), where pk = E(Ik), k = 1, 2, . . . , n. The goal of this paper is to offer tractable solutions for the case where the pk are unknown and must be sequentially estimated. The motivation is that this case is important for many real-world applications of optimal stopping. We study several approaches to incorporate sequential information. Our main result is a new version of the odds algorithm based on online observation and sequential updating. Questions of speed and performance of the different approaches are studied in detail, and the conclusiveness of the comparisons allows us to propose always using this algorithm to tackle selection problems of this kind.